Amortized analysis of smooth quadtrees in all dimensions
نویسندگان
چکیده
منابع مشابه
Amortized Analysis of Smooth Quadtrees in All Dimensions
Quadtrees are a well-known data structure for representing geometric data in the plane, and naturally generalize to higher dimensions. A basic operation is to expand the tree by splitting a given leaf. A quadtree is smooth if adjacent leaf boxes differ by at most one in height. In this paper, we analyze quadtrees that maintain smoothness with each split operation and also maintain neighbor poin...
متن کاملAmortized Analysis of Smooth Box Subdivisions in All Dimensions
1 Quadtrees are a well-known data structure for representing geometric data in the plane, and 2 naturally generalize to higher dimensions. A basic operation is to expand the tree by splitting 3 any given leaf. A quadtree is smooth if any two adjacent leaf boxes differ by at most one in 4 height. In this paper, we analyze quadtrees that maintain smoothness with each split operation. 5 Our main r...
متن کاملDynamic smooth compressed quadtrees (Fullversion)
We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with worst-case constant time updates in constant dimensions. We distinguish two versions of the problem. First, we show that quadtrees as a space-division data structure can be made smooth and dynamic subject to split and merge operations on the quadtree cells. Second, we show that quadtrees used to store a set of points in R c...
متن کاملanalysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولAmortized Analysis
In this lecture, we will cover amortized analysis, which is a method where we consider the average work done over an entire sequence of operations instead of just considering the worst-case cost/time for a single operation; by doing such an analysis, we can obtain tighter bounds in scenarios when expensive operations occur rarely enough that we can charge their cost to more frequent inexpensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2017.02.001